Path decomposition - PDFSEARCH.IO - Document Search Engine

Path decomposition
Results: 318

#	Item
71	A Branch-and-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions Z. Akca ∗ R.T. Berger † Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:53 Operations research Linear programming relaxation Dynamic programming Shortest path problem Linear programming Dantzig–Wolfe decomposition Algorithm Minimum spanning tree Delayed column-generation Mathematics Mathematical optimization Applied mathematics
72	CCCG 2011, Toronto ON, August 10–12, 2011 Approximating the Obstacle Number for a Graph Drawing Efficiently∗ Deniz Sarı¨oz† Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Hypergraph Combinatorics Vertex cover Graph Incidence matrix Planar graph Path decomposition Line graph Graph theory Mathematics NP-complete problems
73	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area Fabrizio Frati∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:28:02 Graph operations Graph drawing Outerplanar graph Geometric graph theory Binary tree Dual graph Tree Graph Path decomposition Graph theory Planar graphs Topological graph theory
74	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Application of computational geometry to network p-center location problems Binay Bhattacharya Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:10:51 Tree decomposition Graph Dynamic programming Tree Shortest path problem Path decomposition Planar separator theorem Graph theory Mathematics Theoretical computer science
75	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 3, MayWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:09 NP-complete problems Bidimensionality Parameterized complexity Kernelization Branch-decomposition Path decomposition Tree decomposition Clique Feedback vertex set Graph theory Theoretical computer science Mathematics
76	CCCG 2011, Toronto ON, August 10–12, 2011 Approximating the Obstacle Number for a Graph Drawing Efficiently∗ Deniz Sarı¨oz† Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Hypergraph Combinatorics Vertex cover Graph Incidence matrix Planar graph Path decomposition Line graph Graph theory Mathematics NP-complete problems
77	Experiments on Area Compaction Algorithms for Orthogonal Drawings Carla Binucci † Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:53 Geometric graph theory Topological graph theory Graph coloring Edge coloring Path decomposition Graph theory Graph drawing Planar graphs
78	ISSNGRACE TECHNICAL REPORTS Towards Bidirectional Transformations on Ordered Graphs Add to Reading List Source URL: www.biglab.org Language: English - Date: 2012-01-12 20:06:23 Directed graph Ordered graph Path decomposition Signed graph Graph theory Graph Null graph
79	Abstracts Wednesday, September 22, :00-10:30 Welcome and invited talk 09:00 Ulrich R¨ udiger, Rector of the University of Konstanz. Add to Reading List Source URL: www.graphdrawing.org Language: English - Date: 2010-09-15 05:44:44 Planar graphs Graph coloring Angular resolution Outerplanar graph Layered graph drawing Minor Graph Intersection graph Path decomposition Graph theory Graph drawing Topological graph theory
80	Journal of Universal Computer Science, vol. 3, no), submitted: 8/8/97, accepted: , appeared:  Springer Pub. Co. A Note on the Computability of Graph Minor Obstruction Sets for Mona Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:38:23 Path decomposition Minor Tree Edge contraction Forbidden graph characterization Graph Neighbourhood Planar graph Connectivity Graph theory Graph operations Robertson–Seymour theorem

UPDATE